منابع مشابه
Simple labeling schemes for graph connectivity
Let G = (V,E) be an undirected graph and let S ⊆ V . The S-connectivity SG(u, v) of a pair of nodes u, v in G is the maximum number of uv-paths that no two of them have an edge or a node in S ∖ {u, v} in common. Edge-connectivity is the case S = ∅ and node-connectivity is the case S = V . Given a graph G = (V,E), an integer k, a subset T ⊆ V of terminals, and S ⊆ V , we consider the problem of ...
متن کاملUndirected Vertex-Connectivity Structure and Smallest Four-Vertex-Connectivity Augmentation
In this paper we study properties for the structure of an undirected graph that is not vertex connected We also study the evolution of this structure when an edge is added to optimally increase the vertex connectivity of the underlying graph Several properties reported here can be extended to the case of a graph that is not k vertex connected for an arbitrary k Using properties obtained here we...
متن کاملVertex Equitable Labeling of Double Alternate Snake Graphs
Let G be a graph with p vertices and q edges and A = {0, 1, 2, . . . , [q/2]}. A vertex labeling f : V (G) → A induces an edge labeling f∗ defined by f∗(uv) = f(u) + f(v) for all edges uv. For a ∈ A, let vf (a) be the number of vertices v with f(v) = a. A graph G is said to be vertex equitable if there exists a vertex labeling f such that for all a and b in A, |vf (a) − vf (b)| ≤ 1 and the indu...
متن کاملInformative Labeling Schemes for Graphs
This paper introduces the notion of informative labeling schemes for arbitrary graphs. Let f (W) be a function on subsets of vertices W . An f labeling scheme labels the vertices of a weighted graph G in such a way that f (W) can be inferred (or at least approximated) efficiently for any vertex subset W of G by merely inspecting the labels of the vertices of W, without having to use any additio...
متن کاملDistance Labeling Schemes for Trees
We consider distance labeling schemes for trees: given a tree with n nodes, label the nodes with binary strings such that, given the labels of any two nodes, one can determine, by looking only at the labels, the distance in the tree between the two nodes. A lower bound by Gavoille et al. [Gavoille et al., J. Alg., 2004] and an upper bound by Peleg [Peleg, J. Graph Theory, 2000] establish that l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2010
ISSN: 1549-6325,1549-6333
DOI: 10.1145/1721837.1721855